On Unit-Refutation Complete Formulae with Existentially Quantified Variables
نویسندگان
چکیده
We analyze, along the lines of the knowledge compilation map, both the tractability and the succinctness of the propositional language URC-C of unit-refutation complete propositional formulae, as well as its disjunctive closure URC-C[∨, ∃], and a superset of URC-C where variables can be existentially quantified and unitrefutation completeness concerns only consequences built up from free variables.
منابع مشابه
Boolean Propagation Based on Literals for Quantified Boolean Formulae
This paper proposes a new set of propagation rules for quantified Boolean formulae based on literals and generated automatically thanks to quantified Boolean formulae certificates. Different decompositions by introduction of existentially quantified variables are discussed in order to construct complete systems. This set of rules is compared with already proposed quantified Boolean propagation ...
متن کاملResolution on Quantified Generalized Clause-sets
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Horn clause-sets are introduced for which a restricted resolution, called quantified positive unit resolution, is proved to be sound and refutationally complete. Moreover, it is shown that the satisfiability for quantifi...
متن کاملAlgorithms for Quantified Constraint Satisfaction Problems
Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reasoning tasks rises from NP-complete to PSPACE-complete. Such problems have, so far, been studied mainly in th...
متن کاملQuantified Constraint Satisfaction Problems: From Relaxations to Explanations
The Quantified Constraint Satisfaction Problem (QCSP) is a generalisation of the classical CSP in which some of variables can be universally quantified. The classical CSP can be seen as a QCSP in which all variables are existentially quantified. The QCSP has attracted significant attention over the past several years, building upon earlier work on Quantified Boolean Formulae. In this paper, we ...
متن کاملFast DQBF Refutation
Dependency Quantified Boolean Formulas (DQBF) extend QBF with Henkin quantifiers, which allow for non-linear dependencies between the quantified variables. This extension is useful in verification problems for incomplete designs, such as the partial equivalence checking (PEC) problem, where a partial circuit, with some parts left open as “black boxes”, is compared against a full circuit. The PE...
متن کامل